Addition-Subtraction Chain for 160 bit Integers by using 2's Complement
نویسندگان
چکیده
Speeding up the scalar multiplication k.P is the major point in elliptic curve cryptosystem efficiency. The Addition-Subtraction (AS) Chain is efficient tool to do that where integer k is fixed and Point P is variable. Since the optimization problem to find the shortest AS Chain is NP-hard, many algorithms to get sub-optimal AS Chain in polynomial time are proposed. The window method is a class of theses algorithms. In this paper an algorithm for finding a shorter AS Chain is proposed. This algorithm is based on window method with small width by using 2’s Complement for 160 bit integers. It is shown practically that proposed algorithm more efficient than the last result in the subject with 20% improvement.
منابع مشابه
VHDL Implementation of 8-Bit ALU
In this paper VHDL implementation of 8-bit arithmetic logic unit (ALU) is presented. The design was implemented using VHDL Xilinx Synthesis tool ISE 13.1 and targeted for Spartan device. ALU was designed to perform arithmetic operations such as addition and subtraction using 8-bit fast adder, logical operations such as AND, OR, XOR and NOT operations, 1’s and 2’s complement operations and compa...
متن کاملA generalization of the Lucas addition chains
In this paper, a generalization of Lucas addition chains, where subtraction is allowed, is given. It is called ”Lucas addition-subtraction chain” (LASC). LASC gives minimal addition-subtraction chains for infinitely many integers and will also be used to prove the optimality of Lucas addition chains for many cases. One of the main result in the theory of addition-subtraction chains is due to Vo...
متن کاملA Representation of Integers by Binary Arithmetics and Addition of Integers
In this article, we introduce the new concept of 2's complement representation. Natural numbers that are congruent mod n can be represented by the same n bits binary. Using the concept introduced here, negative numbers that are congruent mod n also can be represented by the same n bit binary. We also show some properties of addition of integers using this concept. We use the following conventio...
متن کاملModified 32-Bit Shift-Add Multiplier Design for Low Power Application
Multiplication is a basic operation in any signal processing application. Multiplication is the most important one among the four arithmetic operations like addition, subtraction, and division. Multipliers are usually hardware intensive, and the main parameters of concern are high speed, low cost, and less VLSI area. The propagation time and power consumption in the multiplier are always high. ...
متن کاملA Novel Approach to Design 2-bit Binary Arithmetic Logic Unit (ALU) Circuit Using Optimized 8:1 Multiplexer with Reversible logic
Reversible circuit designing is the area where researchers are focussing more and more for the generation of low loss digital system designs. Researchers are using the concept of Reversible Logic in many areas such as Nanotechnology, low loss computing, optical computing, low power CMOS design etc. Here we have proposed a novel design approach for a 2-bit binary Arithmetic Logic Unit (ALU) usin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Egyptian Computer Science Journal
دوره 34 شماره
صفحات -
تاریخ انتشار 2010